Proof nets sequentialisation in multiplicative linear logic
نویسندگان
چکیده
We provide an alternative proof of the sequentialisation theorem for proof nets of multiplicative linear logic. Namely, we show how a proof net can be transformed into a sequent calculus proof simply by properly adding to it some special edges, called sequential edges, which express the sequentiality constraints given by sequent calculus. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Jump from Parallel to Sequential Proofs: Additives
In previous work, we introduced a framework for proof nets of the multiplicative fragment of Linear Logic, where partially sequentialised nets are allowed. In this paper we extend this result to include additives, using a definition of proof net, called J-proof net, which is the typed version of an L-net of Faggian and Maurel. In J-proof nets, we can characterize nets with different degrees of ...
متن کاملJump from Parallel to Sequential Proofs: Multiplicatives
We introduce a new class of multiplicative proof nets, J-proof nets, which are a typed version of Faggian and Maurel’s multiplicative L-nets. In J-proof nets, we can characterize nets with different degrees of sequentiality, by gradual insertion of sequentiality constraints. As a byproduct, we obtain a simple proof of the sequentialisation theorem.
متن کاملSome Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new aspects of the proof theory of MLL2 with units. First, we give a novel proof system in the framework of the calculus of structures. The main feature of the new system is the consequent use of deep inference, which allows us to obs...
متن کاملPartially commutative linear logic: sequent calculus and phase semantics
In this short paper we introduce a variant of intuitionistic multiplicative linear logic that features both commutative and non-commutative connectives. This new logic extends conservatively both Girard’s multiplicative linear logic [2] and Lambek’s syntactic calculus [3]. Ultimately, our goal will be to fulfil the programme achieved by Girard in [2], i.e., to provide our system with: (1) a seq...
متن کاملRetractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof nets, that is a correctness criterion (an algorithm) for checking those proof structures which correspond to proofs of the purely multiplicative and additive fragment of linear logic. This criterion is formulated in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 155 شماره
صفحات -
تاریخ انتشار 2008